Joint Entropy-Constrained Multiterminal Quantization
نویسندگان
چکیده
We study the design of entropy-constrained multiterminal quantizers for coding two correlated continuous sources. Two design algorithms are presented, both optimizing a Lagrangian cost measure involving distortions and information rates.
منابع مشابه
Multiterminal Source Code Design Based on Slepian-Wolf coded quantization∗
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. This paper presents two practical MT coding schemes under the same general framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect quadratic Gaussian MT source coding problems with two encoders. The first asymmetric SWCQ scheme relies on quantization and...
متن کاملConditional entropy-constrained residual VQ with application to image coding
This paper introduces an extension of entropy constrained residual vector quantization (VQ) where intervector dependencies are exploited. The method, which we call conditional entropy-constrained residual VQ, employs a high-order entropy conditioning strategy that captures local information in the neighboring vectors. When applied to coding images, the proposed method is shown to achieve better...
متن کاملNecessary conditions for the optimality of variable-rate residual vector quantizers
-Residual vector quantizatlon (RVQ), or multistage VQ, as it is also called, has recently been shown to be a competitive technique for data compression [1]. The competitive performance of RVQ reported in [1] results from the joint optimization of variable rate encoding and RVQ direct-sum codebooks. In this paper, necessary conditions for the optimality of variable rate RVQs are derived, and an ...
متن کاملError Bounds for High-resolution Quantization with Rényi-α-entropy Constraints
We consider the problem of optimal quantization with norm exponent r > 0 for Borel probability measures on R under constrained Rényi-αentropy of the quantizers. If the bound on the entropy becomes large, then sharp asymptotics for the optimal quantization error are well-known in the special cases α = 0 (memory-constrained quantization) and α = 1 (Shannon-entropy-constrained quantization). In th...
متن کاملConditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory
An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002